首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   369篇
  免费   10篇
  国内免费   1篇
化学   185篇
晶体学   1篇
力学   13篇
数学   133篇
物理学   48篇
  2023年   4篇
  2021年   8篇
  2020年   8篇
  2019年   7篇
  2017年   8篇
  2016年   4篇
  2015年   12篇
  2014年   9篇
  2013年   17篇
  2012年   18篇
  2011年   16篇
  2008年   11篇
  2007年   12篇
  2006年   7篇
  2005年   9篇
  2004年   8篇
  2002年   8篇
  2001年   9篇
  2000年   4篇
  1997年   4篇
  1996年   8篇
  1995年   10篇
  1994年   5篇
  1993年   6篇
  1992年   6篇
  1991年   4篇
  1990年   5篇
  1989年   5篇
  1988年   5篇
  1987年   8篇
  1985年   8篇
  1984年   7篇
  1983年   5篇
  1982年   6篇
  1981年   6篇
  1980年   7篇
  1979年   8篇
  1978年   6篇
  1977年   6篇
  1976年   8篇
  1975年   4篇
  1974年   3篇
  1972年   3篇
  1971年   6篇
  1970年   5篇
  1969年   6篇
  1968年   3篇
  1965年   3篇
  1962年   4篇
  1959年   3篇
排序方式: 共有380条查询结果,搜索用时 156 毫秒
1.
2.
The structure and rotational barrier for the mesityl-silicon bond of 2,2-dimesityl-1,1,1,3,3,3-hexamethyltrisilane have been investigated by 1H- and 13C-variable temperature nuclear magnetic resonance (NMR) as well as by density functional theory structural calculations. The calculations show that the lowest energy structure has C2 symmetry with nonequivalent ortho methyl groups, consistent with the crystal structure and solution NMR. The nonequivalent ortho methyl groups exchange through a Cs transition state with a calculated relative free energy of 11.0 kcal mol−1. The barrier for this rotation found by dynamic NMR is 13.4 ± 0.2 kcal mol−1 at 298 K.  相似文献   
3.
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let AV. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.  相似文献   
4.
5.
This paper introduces the principles, instrumentation, implementation, and industrial applications of an on-line thermal neutron prompt-gamma element analysis system (using a252Cf neutron source, Am–Be neutron source, or neutron generator). The energy resolution of the system at the H prompt-gamma full-energy photopeak (2.22325 MeV) is 3.6 keV. The concentration measurement error of Al2O3, FeO3, CaO, and SiO2 is ±0.3%, ±0.1%, ±0.4%, and ±0.4%, respectively. The system has been tested on-site at both the Shandong and the Zhengzhou Aluminium Works. Our preliminary on-site measurements confirm that the stability, reliability, measurement range, and accuracy of the system can meet the requirements of the aluminium production process. Facilitation of this measurement at aluminium plants is expected to reduce plant costs by over 3 million dollars annually through reduced energy consumption, more rapid qualification of pulps being mixed during the production process, and in reduced labor costs.Other participants of Shandong and Zhenghou Aluminium Works are: Wang Aili, Zengshen, Dei Jianguo and Lu Jinnan, Wang Deyu, Jin Hequan.  相似文献   
6.
OCULAR LIGHT DAMAGE   总被引:2,自引:0,他引:2  
  相似文献   
7.
When can a k-edge-coloring of a subgraph K of a graph G be extended to a k-edge-coloring of G? One necessary condition is that for all X ? E(G) - E(K), where μi(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching. This condition is not sufficient in general, but is sufficient for graphs of very simple structure. We try to locate the border where sufficiency ends.  相似文献   
8.
9.
LetG be a digraph, and letk1, such that no fractional packing of directed circuits ofG has value >k, when every vertex is given capacity 1. We prove there is a set ofO (k logk logk) vertices meeting all directed circuits ofG.  相似文献   
10.
Mass-spectral and n.m.r. analysis of thiophenes labeled by exchange with deuteriosulfuric acid establishes that exchange at the 2 and 5 positions is essentially complete before any deuterium is incorporated at positions 3 and 4. Thus, such exchange is a satisfactory procedure for position-specific labeling. Mass spectra of the labeled thiophenes show that about 60% of the [CHS]+ ion yield is derived from molecular ions that have not undergone prior rearrangement. The remaining 40% arises by a path or paths in which the four hydrogen atoms lose position identity. Other decomposition paths contributing to the mass spectrum are characterized by more nearly complete scrambling of hydrogens.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号